A rewriting logic framework for operational semantics of membrane systems

نویسندگان

  • Oana Andrei
  • Gabriel Ciobanu
  • Dorel Lucanu
چکیده

Existing results in membrane computing refer mainly to P systems’ characterization of Turing computability, also to some polynomial solutions to NP-complete problems by using an exponential workspace created in a “biological way”. In this paper we define an operational semantics of a basic class of P systems, and give two implementations of the operational semantics using rewriting logic. We present some results regarding these implementations, including two operational correspondence results, and discuss why these implementations are relevant in order to take advantage of good features of both structural operational semantics and rewriting logic. c © 2007 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi-rewriting rewriting logic

Rewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-orde...

متن کامل

Electronic Notes in Theoretical Computer Science 7 th International Workshop on Rewriting Logic and its Applications

Membrane systems represent a new model of computation involving parallel application of rules, communication between membranes and dissolving. Since rewriting logic is a general framework for concurrent systems, we connect it with the operational semantics of membrane systems. We use a new representation given by register membranes which are able to express the evolution involving rules with pr...

متن کامل

Matching Logic Rewriting: Unifying Operational and Axiomatic Semantics in a Practical and Generic Framework

Matching logic allows to specify structural properties about program configurations by means of special formulae, called patterns, and to reason about them by means of pattern matching. This paper proposes rewriting over matching logic formulae, which generalizes both term rewriting and Hoare triples, as a unified framework for operational semantics and for program verification. A programming l...

متن کامل

Strategies and Tactics in Operational Semantics

We refer to strategies setting the objective of a computation step rather than to evaluation strategies (as eager or lazy evaluations). We use these strategies to define semantics of a system starting from its elementary operational entities, and then combining them. The tactics of a strategy are given by rewriting steps. While a strategy is at a higher level and defines ”what is the goal” of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 373  شماره 

صفحات  -

تاریخ انتشار 2007